InforLorV4, Main, Exploration, bibRecord, 006165

Truly On-the-Fly LTL Model Checking

Identifieur interne : 006165 ( Main/Exploration ); précédent : 006164; suivant : 006166

Truly On-the-Fly LTL Model Checking

Auteurs : Moritz Hammer [Allemagne] ; Alexander Knapp [Allemagne] ; Stephan Merz [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:06E07B36749C6829A6124384A5B435FBCA5DF3D0

Descripteurs français

Pascal (Inist)
- Automate linéaire, Développement logiciel, Localisation, Logique linéaire, Logique temporelle, Raisonnement basé sur modèle, Système réparti, Système transition, Vérification modèle, Vérification programme.

English descriptors

KwdEn :
- Distributed system, Linear automaton, Linear logic, Localization, Model checking, Model-based reasoning, Program verification, Software development, Temporal logic, Transition system.

Abstract

Abstract: We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan’s algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the Spin model checker, and we present experimental results for some benchmark examples.

Url:

https://api.istex.fr/ark:/67375/HCB-PP2JWFVC-1/fulltext.pdf

DOI: 10.1007/978-3-540-31980-1_13

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Truly On-the-Fly LTL Model Checking</title>
<author><name sortKey="Hammer, Moritz" sort="Hammer, Moritz" uniqKey="Hammer M" first="Moritz" last="Hammer">Moritz Hammer</name>
</author>
<author><name sortKey="Knapp, Alexander" sort="Knapp, Alexander" uniqKey="Knapp A" first="Alexander" last="Knapp">Alexander Knapp</name>
</author>
<author><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:06E07B36749C6829A6124384A5B435FBCA5DF3D0</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/978-3-540-31980-1_13</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-PP2JWFVC-1/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000147</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000147</idno>
<idno type="wicri:Area/Istex/Curation">000147</idno>
<idno type="wicri:Area/Istex/Checkpoint">001478</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001478</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Hammer M:truly:on:the</idno>
<idno type="wicri:Area/Main/Merge">006389</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:05-0288953</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000554</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000484</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000442</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000442</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Hammer M:truly:on:the</idno>
<idno type="wicri:Area/Main/Merge">006579</idno>
<idno type="wicri:Area/Main/Curation">006165</idno>
<idno type="wicri:Area/Main/Exploration">006165</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Truly On-the-Fly LTL Model Checking</title>
<author><name sortKey="Hammer, Moritz" sort="Hammer, Moritz" uniqKey="Hammer M" first="Moritz" last="Hammer">Moritz Hammer</name>
<affiliation wicri:level="4"><orgName type="university">Université Louis-et-Maximilien de Munich</orgName>
<country>Allemagne</country>
<placeName><settlement type="city">Munich</settlement>
<region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Knapp, Alexander" sort="Knapp, Alexander" uniqKey="Knapp A" first="Alexander" last="Knapp">Alexander Knapp</name>
<affiliation wicri:level="4"><orgName type="university">Université Louis-et-Maximilien de Munich</orgName>
<country>Allemagne</country>
<placeName><settlement type="city">Munich</settlement>
<region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Haute-Bavière</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
<affiliation wicri:level="3"><country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<wicri:orgArea>INRIA Lorraine, LORIA</wicri:orgArea>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Distributed system</term>
<term>Linear automaton</term>
<term>Linear logic</term>
<term>Localization</term>
<term>Model checking</term>
<term>Model-based reasoning</term>
<term>Program verification</term>
<term>Software development</term>
<term>Temporal logic</term>
<term>Transition system</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Automate linéaire</term>
<term>Développement logiciel</term>
<term>Localisation</term>
<term>Logique linéaire</term>
<term>Logique temporelle</term>
<term>Raisonnement basé sur modèle</term>
<term>Système réparti</term>
<term>Système transition</term>
<term>Vérification modèle</term>
<term>Vérification programme</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan’s algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the Spin model checker, and we present experimental results for some benchmark examples.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
<li>France</li>
</country>
<region><li>Bavière</li>
<li>District de Haute-Bavière</li>
<li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Munich</li>
<li>Nancy</li>
</settlement>
<orgName><li>Université Louis-et-Maximilien de Munich</li>
</orgName>
</list>
<tree><country name="Allemagne"><region name="Bavière"><name sortKey="Hammer, Moritz" sort="Hammer, Moritz" uniqKey="Hammer M" first="Moritz" last="Hammer">Moritz Hammer</name>
</region>
<name sortKey="Hammer, Moritz" sort="Hammer, Moritz" uniqKey="Hammer M" first="Moritz" last="Hammer">Moritz Hammer</name>
<name sortKey="Knapp, Alexander" sort="Knapp, Alexander" uniqKey="Knapp A" first="Alexander" last="Knapp">Alexander Knapp</name>
<name sortKey="Knapp, Alexander" sort="Knapp, Alexander" uniqKey="Knapp A" first="Alexander" last="Knapp">Alexander Knapp</name>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
</region>
<name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006165 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006165 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:06E07B36749C6829A6124384A5B435FBCA5DF3D0
   |texte=   Truly On-the-Fly LTL Model Checking
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

Truly On-the-Fly LTL Model Checking

Truly On-the-Fly LTL Model Checking

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.